A Class-based Probabilistic approach to Structural Disambiguation
نویسندگان
چکیده
Knowledge of which words are able to ll particular argument slots of a predicate can be used for structural disambiguation. This paper describes a proposal for acquiring such knowledge, and in line with much of the recent work in this area, a probabilistic approach is taken. We develop a novel way of using a semantic hierarchy to estimate the probabilities, and demonstrate the general approach using a prepositional phrase attachment experiment.
منابع مشابه
Using a Probabilistic Class-Based Lexicon for Lexical Ambiguity Resolution
This paper presents the use of probabilistic class-based lexica for disambiguation in targetword selection. Our method employs minimal but precise contextual information for disambiguation. That is, only information provided by the target-verb, enriched by the condensed information of a probabilistic class-based lexicon, is used. Induction of classes and fine-tuning to verbal arguments is done ...
متن کاملA Probabilistic Approach to Lexical Semantic Knowledge Acquisition and Structural Disambiguation
Structural disambiguation in sentence analysis is still a central problem in natural language processing. Past researches have verified that using lexical semantic knowledge can, to a quite large extent, cope with this problem. Although there have been many studies conducted in the past to address the lexical knowledge acquisition problem, further investigation, especially that based on a princ...
متن کاملIn Proceedings of the 18 th International Conference on Computational Linguistics , 2000 , Saarbrücken . Using a Probabilistic Class - Based Lexiconfor
This paper presents the use of probabilistic class-based lexica for disambiguation in target-word selection. Our method employs minimal but precise contextual information for disam-biguation. That is, only information provided by the target-verb, enriched by the condensed information of a probabilistic class-based lexicon , is used. Induction of classes and ne-tuning to verbal arguments is done...
متن کاملTree-gram Parsing: Lexical Dependencies and Structural Relations
This paper explores the kinds of probabilistic relations that are important in syntactic disambiguation. It proposes that two widely used kinds of relations, lexical dependencies and structural relations, have complementary disambiguation capabilities. It presents a new model based on structural relations, the Tree-gram model, and reports experiments showing that structural relations should ben...
متن کاملGPSM: A Generalized Probabilistic Semantic Model for Ambiguity Resolution
In natural language processing, ambiguity resolution is a central issue, and can be regarded as a preference assignment problem. In this paper, a Generalized Probabilistic Semantic Model (GPSM) is proposed for preference computation. An effective semantic tagging procedure is proposed for tagging semantic features. A semantic score function is derived based on a score function, which integrates...
متن کامل